Enhancing Probabilistic Model Checking with Ontologies
نویسندگان
چکیده
منابع مشابه
Probabilistic Model Checking
Markov chains (MC) and Markov decision processes (MDP) are widely used as operational models for the quantitative system analysis. They can be understood as transition systems augmented with distributions for the states (in MC) or state-action pairs (in MDPs) to specify the probabilities for the successor states. Additionally one might add weight functions for modeling accumulated costs or rewa...
متن کاملProbabilistic Model Checking with Java PathFinder?
On the one hand, probabilistic model checkers such as PRISM [1] have been successfully employed to verify models of probabilistic systems. However, they are not suitable for checking properties such as uncaught exceptions of the actual code of the system. On the other hand, model checkers such as Java PathFinder (JPF) [2] have been used with success to verify actual code of systems. However, th...
متن کاملGrid-enabled Probabilistic Model Checking with PRISM∗
In this paper, we present our work on extending the probabilistic model checking tool PRISM with Grid computing capabilities. PRISM is a tool for the verification and analysis of large, probabilistic models, a process which involves numerical solution techniques. Like most verification tools, PRISM can be very resource intensive and will benefit greatly from parallelisation efforts. Grid comput...
متن کاملModel checking with probabilistic tabled logic programming
We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of probabilistic models and probabilistic temporal logics. The inference algorithms of existing probabilistic logic-programming systems are well defined only for qu...
متن کاملCounterexamples in Probabilistic Model Checking
This paper considers algorithms for counterexample generation for (bounded) probabilistic reachability properties in fully probabilistic systems. Finding the strongest evidence (i.e, the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that are mostly deviating from the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2021
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-021-00549-0